Graphs with average labellings

نویسندگان

  • Matús Harminc
  • Roman Soták
چکیده

For a given simple graph an average labelling is de)ned. The graphs with average labellings and all the admissible average labellings for such graphs are characterized. c © 2001 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connections between labellings of trees

There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.

متن کامل

On a characterization of graphs by average labellings

The additive hereditary property of linear forests is characterized by the existence of average labellings.

متن کامل

Improper Graceful and Odd-graceful Labellings of Graph Theory

Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.

متن کامل

Magic labellings of infinite graphs

There are many results on edge-magic, and vertex-magic, labellings of finite graphs. Here we consider magic labellings of countably infinite graphs over abelian groups. We also give an example of a finite connected graph that is edge-magic over one, but not over all, abelian groups of the appropriate order.

متن کامل

A new infinite family of graceful generalised Petersen graphs, via graceful collages again

By strengthening an edge-decomposition technique for gracefully labelling a generalised Petersen graph, we provide graceful labellings for a new infinite family of such graphs. The method seems flexible enough to provide graceful labellings for many other classes of graphs in the future.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 233  شماره 

صفحات  -

تاریخ انتشار 2001